@dellaert so I am really struggling with implementing this function correctly in the decision tree

// Applying binary operator to two leaves results in a leaf
  NodePtr apply_g_op_fL(const Leaf& fL, const Binary& op) const override {
    // fL op gL
    // TODO(Varun) Is the nrAssignments setting correct?
    NodePtr h(new Leaf(op(fL.constant_, constant_), fL.nrAssignments()));
    return h;
  }

I only need nrAssignments for pruning in the DecisionTreeFactor, so I replaced that with a loop over all the assignments in the cartesian product (which is a bit slower)

auto allValues = DiscreteValues::CartesianProduct(this->discreteKeys());
for (auto&& val : allValues) {
  double prob = (*this)(val);
  probabilities.push_back(prob);
}

It seems that there is no time improvement, since the test case is now taking 131.93 seconds compared to 117 seconds with the cartesian product taking up 12.8236 seconds (which accounts for the time difference).

My conclusion is that perhaps the DecisionTreeFactor is inherently non-scalable, which means I should perhaps move to the TableFactor.

I am contemplating removing the nrAssignments variable since I introduced it just for pruning and it is not being correctly computed. :(